138 research outputs found

    Optimistic chordal coloring: a coalescing heuristic forSSAform programs

    Get PDF
    The interference graph for a procedure in Static Single Assignment (SSA) Form is chordal. Since the k-colorability problem can be solved in polynomial-time for chordal graphs, this result has generated interest in SSA-based heuristics for spilling and coalescing. Since copies can be folded during SSA construction, instances of the coalescing problem under SSA have fewer affinities than traditional methods. This paper presents Optimistic Chordal Coloring (OCC), a coalescing heuristic for chordal graphs. OCC was evaluated on interference graphs from embedded/multimedia benchmarks: in all cases, OCC found the optimal solution, and ran, on average, 2.30Ă— faster than Iterated Register Coalescin

    Standardizing design performance comparison in microfluidic manufacturing

    Get PDF
    Microfluidic devices published in literature today lack sufficient information for automating the physical design process. Moreover, the constantly changing landscape of manufacturing and technological requirements poses a large problem in the physical design automation space. In this talk, we discuss some of the methodologies and standards formulated by CIDAR at BU and CARES at UC Riverside that allow not only allow the researchers in the physical design automation space to share and compare their results but also provide means for capturing the Specify, Design and Build lifecycle in microfluidic design

    SSI Revisited

    Get PDF
    The static single information (SSI) form, proposed by Ananian, then in a more general form by Singer, is an extension of the static single assignment (SSA) form. The latter is a well-established compiler intermediate representation that has been successfully used for numerous compiler analysis and optimizations. Several interesting results have also been shown for SSI concerning liveness analysis and representation of live-ranges of variables, which could make SSI appealing for just-in-time compilation. Unfortunately, previous literature on the SSI form is sparse and appears to be partly incorrect. Our paper corrects some of the mistakes that have been made. Our main result is a complete proof that, even for the most general definition of SSI, basic blocks, and thus program points, can be totally ordered so that live-ranges of variables correspond to intervals. This corrects the erroneous proof of Brisk and Sarrafzadeh

    Thermal-Aware Data Flow Analysis

    Get PDF
    This paper suggests that the thermal state of a processor can be approximated using data flow analysis. The results of this analysis can be used to evaluate the efficacy of thermal-aware compilation strategies, or as input to thermal-aware optimizations that occur in the early stages of back-end compilation. We propose different ways how the exploitation of thermal behavior knowledge can be included in the different compilation phases. Copyright 2009 ACM

    TCAD EIC Message: February 2019

    No full text
    • …
    corecore